Roots and Canonical Forms for Circulant Matrices
نویسنده
چکیده
منابع مشابه
Computation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملEigenvectors of block circulant and alternating circulant matrices
The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...
متن کاملSmall circulant complex Hadamard matrices of Butson type
We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fourier matrix, while for n = p+ q, l = pq with p, q distinct primes there is no such matrix. We then provide a list of equivalence classes of such matrices, for small values of n, l.
متن کاملCyclic p-roots of prime length p and related complex Hadamard matrices
In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to ( 2p−2 p−1 ) . In particular, the number of complex circulant Hadamard matrices of size p, with diagonal entries equal to 1, is less than or equal to ( 2p−2 p−1 ) .
متن کاملComputation of Maximal Determinants of Binary Circulant Matrices
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here “binary matrix” means a matrix whose elements are drawn from {0, 1} or {−1, 1}. We describe efficient parallel algorithms for the search, using Duval’s algorithm for generation of Lyndon words and the well-known representation of the determinant of a circulant in terms of roots of unity....
متن کامل